Efficient hybrid search for visual reconstruction problems
نویسندگان
چکیده
منابع مشابه
hybrid harmony search for conditional p-median problems
in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.
متن کاملHybrid Probabilistic Search Methods for Simulation Optimization
Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...
متن کاملHybrid Tabu Search for Lot Sizing Problems
This paper presents a hybrid tabu search strategy for lot sizing problems. This strategy allows the exploitation of the quality of the well-known relax-and-fix heuristic, inside a tabu search framework which enforces diversity. The computational results show an advantage of this strategy when compared to a version of the relax-and-fix heuristic and to time constrained branch-and-bound.
متن کاملEfficient Hybrid Search Techniques For Circuit Partitioning
– Recently, four search approaches have emerged for handling complex combinatorial optimization problems: Simulated Annealing, Genetic Algorithms, Tabu Search and Greedy Randomized Search Procedure (GRASP). Based on simple ideas, these heuristics have been extremely efficient in finding near-optimal or optimal solutions for many types of difficult problems [1]. In this paper we apply these appr...
متن کاملAn efficient modified neural network for solving nonlinear programming problems with hybrid constraints
This paper presents the optimization techniques for solving convex programming problems with hybrid constraints. According to the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalleinvariance principle, a neural network model is constructed. The equilibrium point of the proposed model is proved to be equivalent to the optima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Image and Vision Computing
سال: 1999
ISSN: 0262-8856
DOI: 10.1016/s0262-8856(98)00088-2